Optimal Allocation of Redundancy Between Packet-Level Erasure Coding and Physical-Layer Channel Coding in Fading Channels

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Utility Optimal Coding for Packet Transmission over Wireless Networks – Part II: Networks of Packet Erasure Channels

We define a class of multi–hop erasure networks that approximates a wireless multi–hop network. The network carries unicast flows for multiple users, and each information packet within a flow is required to be decoded at the flow destination within a specified delay deadline. The allocation of coding rates amongst flows/users is constrained by network capacity. We propose a proportional fair tr...

متن کامل

Packet-Layer Forward Error Correction Coding for Fading Mitigation

In an on/off-keying atmospheric optical communication system, index of refraction turbulence and PAT (pointing, acquisition and tracking) instabilities create strong and very slow fading compared to the usually used high data-rates. With this channel behavior, forward error correction can only work effectively if the codeword-length is longer than the mean duration of fade. Therefore packet-lay...

متن کامل

Joint Cache-Channel Coding over Erasure Broadcast Channels

We consider a cache-aided communications system in which a transmitter communicates with many receivers over an erasure broadcast channel. The system serves as a basic model for communicating on-demand content during periods of high network congestion, where some content can be preplaced in local caches near the receivers. We formulate the cacheaided communications problem as a joint cache-chan...

متن کامل

Optimal Coding for the Erasure Channel with Arbitrary Alphabet Size

An erasure channel with a fixed alphabet size q, where q ≫ 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming maximum likelihood decoding). Assuming a memoryless erasure channel, the error exponent of MDS codes are compared with that of random codes and linear random codes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Communications

سال: 2011

ISSN: 0090-6778

DOI: 10.1109/tcomm.2011.062311.090277